CPTG 244 - Data Structures

Topics

Week 1
• C++ Overview (1 - 3)
• Classes. Constructors and Destructors (1.5.2). Memory Allocation (1.5.3)
• Inheritance and Polymorphism (2.2). Templates (2.3). Exceptions (2.4)
• Linked Lists (3.1 - 3.4).

Week 2
• Recursion (3.5)
• Timing and Analysis Functions (4.1)
• Big-Oh Analysis (4.2)

Week 3
• Stacks (5.1). Queues 5.2). Deques (5.3)
• Vectors (6.1). Lists (6.2). Sequences (6.3)

Midterm 1

Week 4
• Trees (7.1)
• Tree Traversal (7.2)
• Binary Trees (7.3)

Week 5
• Priority Queues (8.1, 8.2)
• Heaps (8.3)
• Heap-Sort (8.3.5)
• Heap-Sort (8.3.5)

Week 6
• Maps (9.1)
• Hash Tables (9.2)
• Ordered Maps (9.3)
• Dictionaries (9.5)

Midterm 2

Week 7
• Binary Search Trees (10.1)
• AVL Trees (10.2)

Week 8
• Merge-Sort (11.1)
• Quick-Sort (11.2)
• Sets and Union (11.4)

Week 9
• Graphs (13.1, 13.2)
• Graph Traversals (13.3)
• Directed Graphs (13.4)
• Depth-First Search (13.3.1)

Week 10
• Shortest Paths (13.5)
• Minimum Spanning Trees (13.6)

Final Project